Optimal survival trees
نویسندگان
چکیده
Abstract Tree-based models are increasingly popular due to their ability identify complex relationships that beyond the scope of parametric models. Survival tree methods adapt these allow for analysis censored outcomes, which often appear in medical data. We present a new Optimal Trees algorithm leverages mixed-integer optimization (MIO) and local search techniques generate globally optimized survival demonstrate OST improves on accuracy existing methods, particularly large datasets.
منابع مشابه
optimal joint survival probability of xl reinsurance contracts in iran insurance company
اگر تنها یک صنعت جهت حفظ تعادل در بازار جهانی ضروری باشد، می توان ادعا نمود که آن صنعت بیمه است. صنعت بیمه بدون کمک صنعت بیمه اتکایی قادر به انجام وظیفه خویش نخواهد بود. اکثر تحقیقات انجام گرفته در زمینه بیمه اتکایی تنها با در نظر گرفتن منافع شرکت بیمه شده بوده است و منافع شرکت بیمه گر اتکایی کمتر مورد توجه بوده است. در این رساله با در نظر گرفتن منافع همزمان هر دو شرکت بیمه گذار اصلی و بیمه گر ...
15 صفحه اولOptimal 2, 3-Trees
The 2,3-trees that are optimal in the sense of having minimal expected number of nodes visited per access are characterized in terms of their "profiles". The characterization leads directly to a linear-time algorithm for constructing a K-key optimal 2,3-tree for a sorted list of K keys. A number of results are derived that demonstrate how different in structure these optimal 2,3-trees are from ...
متن کاملOptimal Alphabetic Ternary Trees
We give a new algorithm to construct optimal alphabetic ternary trees, where every internal node has at most three children. This algorithm generalizes the classic Hu-Tucker algorithm, though the overall computational complexity has yet to be determined.
متن کاملOptimal junction Trees
Finn V. Jensen Frank Jensen Department of Mathematics and Computer Science Aalborg University Fredrik Bajers Vej 7E, DK-9220 Aalborg st, Denmark E-mail: [email protected], [email protected] Abstract The paper deals with optimality issues in connection with updating beliefs in networks. We address two processes: triangulation and construction of junction trees. In the rst part, we give a simple algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2022
ISSN: ['0885-6125', '1573-0565']
DOI: https://doi.org/10.1007/s10994-021-06117-0